Abstraction In Model Checking Real-Time Temporal Logic of Knowledge
نویسندگان
چکیده
ion In Model Checking Real-Time Temporal Logic of Knowledge CongHua Zhou Jiangsu University, Zhenjiang, 212013, China Email: [email protected] Bo Sun Jiangsu University, Zhenjiang, 212013, China Email: [email protected] Abstract—Model checking in real-time temporal logic of knowledge TACTLK confronts the same challenge as in traditional model checking, that is the state space explosion problem. In order to alleviate this problem, we present our abstraction techniques. For the real time part of TACTLK, that is TACTL, we adopt the abstract discrete clock valuations, and in this way the infinite state space of a real time interpreted system can be converted into a finite form. For the epistemic operator K in TACTLK, the definition of epistemic equivalent to an agent between abstract states is given, therefore, the corresponding equivalent relations can be deduced and which can be used to combine the abstract states, as a result, the state space of the real time interpreted system can be further simplified. Finally, we adopt a variant of the standard railroad crossing system to illustrate the effectiveness of our abstraction techniques.Model checking in real-time temporal logic of knowledge TACTLK confronts the same challenge as in traditional model checking, that is the state space explosion problem. In order to alleviate this problem, we present our abstraction techniques. For the real time part of TACTLK, that is TACTL, we adopt the abstract discrete clock valuations, and in this way the infinite state space of a real time interpreted system can be converted into a finite form. For the epistemic operator K in TACTLK, the definition of epistemic equivalent to an agent between abstract states is given, therefore, the corresponding equivalent relations can be deduced and which can be used to combine the abstract states, as a result, the state space of the real time interpreted system can be further simplified. Finally, we adopt a variant of the standard railroad crossing system to illustrate the effectiveness of our abstraction techniques.
منابع مشابه
Three-valued Abstraction in Model Ckecking Probabiblistic Real-time Temporal Logic of Knowledge
Model checking in probabilistic real-time temporal logic of knowledge PTACTLK confronts the same challenge as in traditional model checking, that is the state space explosion problem. Abstraction is one of the most effective methods to alleviate the state space explosion problem, under the traditional framework of two-valued abstraction, the abstract model obtained using abstraction techniques ...
متن کاملModel Checking for Real-Time Temporal, Cooperation and Epistemic Properties
In this paper, we introduce a real-time temporal knowledge logic, called RTKL, which is a combination of real-time temporal logic and knowledge logic. It is showed that temporal modalities such as “always in an interval”, “until in an interval”, and knowledge modalities such as “knowledge in an interval” and “common knowledge in an interval” can be expressed in such a logic. The model checking ...
متن کاملA Game-based Framework for Ctl Counterexamples and Abstraction-reenement a Game-based Framework for Ctl Counterexamples and Abstraction-reenement
Model checking is an e cient procedure that checks whether or not a given system model ful lls a desired property, described as a temporal logic formula. Yet, as real models tend to be very big, model checking encounters the state-explosion problem. One solution to this problem is the use of abstraction, that hides some of the details of the original (concrete) model. In this work we consider t...
متن کاملVerification of Real-Time Systems by Abstraction of Time Constraints
This paper presents a new methodology for model checking real-time systems based on the abstraction of time predicates. A real-time system is modeled with a timed automaton which is translated to a real-time program. The properties are specified with the temporal logic TCTL (Timed Computational Tree Logic). The real-time program and the TCTL property are used first, for producing a new automato...
متن کاملModel checking for in nite state systems
A method combining data abstraction, model checking and theorem proving is presented. It provides a semi-automatic, formal framework for proving arbitrary linear time temporal logic properties of inn-nite state reactive systems. The paper contains a complete case study to prove safety and liveness of an implementation of a scheduler for the readers/writers problem which uses unbounded queues an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCP
دوره 7 شماره
صفحات -
تاریخ انتشار 2012